Data transmission using repeated sets of spreading sequences

ABSTRACT

Data transmission process using repetitive sets of spreading sequences, and corresponding transmitter and receiver. According to the invention, spectrum spreading is done on symbol packets using sets of pseudo-random sequences used repetitively. This thus reduces interference between symbols. Application to digital communications by spectrum spreading.

TECHNICAL DOMAIN

The purpose of this invention is a process for transmission of data using repetitive sets of spreading sequences, and a corresponding transmitter and receiver.

The invention is broadly applied for digital communications and more particularly for Wireless Local Area Networks (WLANs), Wireless subscriber Local Loops (WLL), mobile telephony, intelligent building management systems and remote charging, communication for transport, cable television, multimedia service on cable networks, etc.

STATE OF PRIOR ART

The invention relates to the spectrum spreading technique. It is known that this technique consists of modulating a digital symbol to be transmitted by a pseudo random sequence known to the user. Each sequence is composed of N elements called “chips” that have a duration of one N^(th) of the duration of a symbol. The result is a signal for which the spectrum is spread over a range N times wider than the range of the original signal. On reception, demodulation consists of correlating the received signal with the sequence used in sending to find the initial symbol.

This technique has many advantages, but it cannot overcome a disadvantage related to an interference effect between symbols which originates as follows. In a radioelectric channel, the wave that propagates from the transmitter to the receiver may follow various paths such that several signals reach the receiver at different time, with different amplitudes and phases, for the same transmitted signal. Therefore the response of the channel to the transmitted signal is spread. Since the sent signal is usually short, it can be treated like a pulse and it is then referred to as a pulse response. In high throughput systems, these various replicas of the same signal can interfere with other signals.

FIG. 1 illustrates this phenomenon. It shows the pulse response h(t) of a channel as a function of time. On part A, it is assumed that a pulse was transmitted at a given time and that a first signal a, was received with a given delay τ₁, followed by a replica a₂ at time τ₁+Tm, where Tm is the time by which the second path lags behind the first. On part B, it is assumed that a second signal was sent after an interval Ts equal to the duration of a symbol and it is also assumed that this interval is equal to the delay Tm. It is also assumed that the properties of the channel are not modified within the interval Ts, in other words the delay τ₂ is equal to τ₁ and T_(m) remains constant. A signal b₁ is then received at time τ₂ followed by a replica b₂ at time τ₂+T_(m).

Since it is assumed that Ts=Tm, it is obvious that the signals a₂ and b₁ will interfere and degrade reception. This source of degradation can be avoided by taking steps such that b₁ appears beyond a₂, in other words the duration Ts of the symbols is greater than the spreading Tm of the pulse response. In other words, the symbol flow rate must be less than 1/Tm. The constraint on the flow rate is greater when the pulse response is spread more.

The purpose of the invention is to overcome this disadvantage. By reducing the interference phenomenon between symbols, the invention enables higher flow rates in environments in which spreading of the pulse response of the channel is much greater than the duration of the symbol (up to 16 times in an example described later).

Document EP-A-0 693 834 describes a CDMA type mobile radiocommunication system in which the base station/mobile station link uses one or the other spreading sequence, the sequence being used in sending being identified such that the mobile station can unspread the received signal. The signal can be transmitted on three parallel channels using three different codes, to increase the information flow rate.

DESCRIPTION OF THE INVENTION

The invention recommends that successive symbols should be processed with different pseudo random sequences in order to reduce the risks of interference between symbols, since this makes it possible to better discriminate received signals on reception. According to the invention, the number of different successive sequences is limited to a fixed number S. Beyond S sequences, the previously used sequences are reused. In other words, packets of S symbols can be processed by repetitive sets of S sequences. The result is that the time interval after which the same pseudo random sequence is repeated is no longer Ts, but becomes S times Ts. Therefore the constraint on the duration of the symbol is no longer Ts>Tm, but becomes STs>Tm. In terms of throughput, this means that for a given spreading, the authorized throughput is S times higher than in prior art. The upper limit is no longer 1/Tm, but becomes S/Tm.

This process that consists of processing packets of S symbols in repetitive sets of S pseudo random sequences can be further improved by processing several packets of S symbols in parallel, each with different sequence sets.

Therefore, more precisely, the purpose of the invention is a process for data transmission by spectrum spreading in which:

-   -   in sending: symbols are built up from the data to be         transmitted, and are modulated by spectrum spreading using         pseudo-random sequences,     -   on reception: the received signal is correlated with the         pseudo-random sequences used in sending, the symbols sent are         found and the data are restored,         this process being characterized in that:

a) in sending:

-   -   i) a set of S successive different pseudo-random sequences is         built up, in which S is equal to at least 2,     -   ii) the symbols to be transmitted are grouped into successive         packets each containing S symbols,     -   iii) the S successive symbols of a packet are modulated by the S         successive pseudo-random sequences of the set of sequences,     -   iv) operation iii) is repeated for successive packets of S         symbols, the pseudo-random sequences in the set thus being used         repetitively,

b) on reception:

the received signal is correlated with each of the S pseudo-random sequences used in sending, the successive packets of symbols are restored and the corresponding data are restored.

The conversion made during transmission could be a summation.

In one particular embodiment, several packets of S symbols are processed in parallel.

Another purpose of the invention is a transmitter and a receiver for embodiment of this process.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1, already described, illustrates the interference phenomenon between symbols;

FIG. 2 shows an embodiment of a transmitter according to the invention;

FIG. 3 shows an embodiment of a receiver according to the invention.

DESCRIPTION OF PARTICULAR EMBODIMENTS

Data to be transmitted are firstly organized into symbols using standard techniques. Each symbol may include one or several bits. The symbols are then organized in packets of S. If required, parallel processing can also be carried out, L packets of S symbols are used in parallel giving a total of M=LS symbols. The following symbols are organized in the same way to build up a new set of M symbols and so on.

Table I illustrates this series-parallel organization. Each box represents a symbol. The first set of symbols is denoted $S\frac{1}{ij}$ where i denotes the row in the table, in other words the rank of the packet (where i varies from 1 to L) and j is the column, in other words the rank in the packet (where j varies from 1 to S). In the second set, the LS symbols are denoted $S\frac{2}{ij}$

and so on. TABLE I j i 1 2 S 1 2 S 1 $S\frac{1}{11}$ $S\frac{1}{12}$ $S\frac{1}{1S}$ $S\quad\frac{2}{11}$ $S\quad\frac{2}{12}$ $S\quad\frac{2}{1\text{S}}$ $S\quad\frac{3}{11}$ 2 $S\quad\frac{1}{21}$ $S\quad\frac{1}{22}$ $S\quad\frac{1}{2S}$ $S\quad\frac{2}{21}$ $S\quad\frac{2}{22}$ $S\quad\frac{2}{LS}$ $S\quad\frac{3}{21}$ $S\quad\frac{1}{ij}$ $S\quad\frac{2}{ij}$ L $S\quad\frac{1}{L1}$ $S\quad\frac{1}{L2}$ $S\quad\frac{1}{Ls}$ $S\quad\frac{2}{L1}$ $S\quad\frac{2}{L2}$ $S\quad\frac{2}{LS}$ $S\quad\frac{3}{L1}$

All these symbols are processed by spectrum spreading using LS different pseudo-random sequences, preferably orthogonal. These sequences are organized as shown in table II. They are denoted C_(ij), where i varies from 1 to L and j varies from 1 to S. TABLE II _(ij) 1 2 S 1 C₁₁ C₁₂ C_(1S) 2 C₂₁ C₂₂ C_(2S) C_(ij) L C_(L1) C_(L2) C_(LS)

A symbol S_(ij) in table I is processed by the corresponding pseudo-random sequence C_(ij) in table II. When the M sequences have been used for a set of M symbols, the same sequences are reused for the next set of M symbols and so on. Therefore, the interval at which sequences are reused is ST_(s).

Some numerical examples are given for explanatory purposes to illustrate the advantages provided by the invention; these examples are in no way restrictive. It is assumed that work is done with a binary flow rate of 2 Mbits/s in QPSK (Quaternary Phase Shift Keying) modulation. Therefore the number of bits per symbol is 2. The duration Ts of a symbol is 1 μS. With a process in accordance with the state of prior art, this would mean that spreading of the channel Tm should be limited to 1 μs. The invention uses L channels in parallel (where L=M/S). Therefore the number of bits transmitted in a symbol period Ts is equal to m=2L. Table III contains a few examples of maximum spreading Tm_(max) that can be allowed for two values of M (8 and 16), and 3 values of S (4, 8 and 16 respectively) for each. TABLE III M = 8 M = 16 S = 4 m = 4 bits/symb m = 8 bits/symb Tm_(max) = 8 μs Tm_(max) = 16 μs S = 8 m = 2 bits/symb m = 4 bits/symb Tm_(max) = 8 μs Tm_(max) = 16 μs S = 16 m = 2 bits/symb Tm_(max) = 16 μs

FIGS. 2 and 3 illustrate example embodiments of a transmitter and a receiver according to the invention. In FIG. 2, the transmitter comprises a general input 10 into which data d to be transmitted are input, a circuit 20 transforming these data into symbols (it may be phase shift keying (PSK) modulator), a means 30 of forming packets each containing S symbols, namely P_(i) (i varying from 1 to L). In the variant illustrated, the transmitter comprises a series-parallel converter 40 with L outputs 40 ₁, 40 ₂, . . . , 40 _(i), . . . , 40 _(L) outputting L packets P_(i), a table 50 of pseudo-random sequences C_(ij), with L outputs 50 ₁, 50 ₂, . . . , 50 _(j), . . . , 50 _(L) outputting L sets of sequences, a circuit 60 of spreading symbols S_(ij) with sequences C_(ij), this circuit having L outputs 60 ₁, 60 ₂, . . . , 60 _(i), . . . , 60 _(L) outputting spread spectrum symbols, an adder 70 and finally transmission means symbolized by an antenna 80.

The receiver shown in FIG. 3 comprises reception means symbolized by the antenna 100, a bank of M matched filters 110 ₁, . . . , 110 _(M), each of these filters being matched to one of the pseudo-random sequences C_(ij) used in sending, a bank of M circuits 120 ₁, . . . , 120 _(M) estimating the energy (or the amplitude) of signals output by the previous matched filters, a circuit 130 with M inputs 132 ₁, . . . , 132 _(M) and L outputs 134 ₁, . . . , 134 _(L) determining which of the M input channels contain maximum energy and outputting a selection signal on one or several of the L outputs, L circuits 140 ₁, . . . , 140 _(L) with M inputs connected to the outputs of M matched filters and selecting one among M inputs as a function of the received selection signal, L demodulators 150 ₁, . . . , 150 _(L), for example of the PSK type, a circuit 160 putting L packets of symbols output by the demodulators into series, a circuit 170 restoring data d on a general output 180.

Processing in parallel is simply an option, the essential feature of the invention being that a set of different successive sequences is used. 

1-6. (canceled)
 7. A method for spectrum spread transmission of data symbols, comprising: generating a plurality of pseudo-random sequences wherein each sequence of the plurality of pseudo-random sequences differ from each other sequence of the plurality of sequences; grouping a plurality of symbols into a packet; and modulating the packet using the plurality of pseudo-random sequences.
 8. The method of claim 7, wherein generating a plurality of pseudo-random sequences comprises generating S pseudo-random sequences.
 9. The method of claim 8, wherein grouping a plurality of symbols into a packet comprises grouping S symbols into a packet.
 10. The method of claim 9, wherein modulating the packet comprises modulating the S symbols using the S pseudo-random sequences.
 11. The method of claim 10, wherein the S pseudo-random sequences comprise S successive pseudo-random sequences.
 12. The method of claim 11, wherein the S symbols comprise S successive symbols.
 13. The method of claim 12, wherein S comprises a number equal to or greater than two.
 14. An apparatus capable of spectrum spread transmission of data symbols, comprising: means for generating a plurality of pseudo-random sequences wherein each sequence of the plurality of pseudo-random sequences differ from each other sequence of the plurality of sequences; means for grouping a plurality of symbols into a packet; and means for modulating the packet using the plurality of pseudo-random sequences.
 15. The apparatus of claim 14, wherein the means for generating a plurality of pseudo-random sequences comprises means for generating S pseudo-random sequences.
 16. The apparatus of claim 15, wherein the means for grouping a plurality of symbols into a packet comprises means for grouping S symbols into a packet.
 17. The apparatus of claim 16, wherein the means for modulating the packet comprises means for modulating the S symbols using the S pseudo-random sequences.
 18. The apparatus of claim 17, wherein the S pseudo-random sequences comprise S successive pseudo-random sequences.
 19. The apparatus of claim 18, wherein the S symbols comprise S successive symbols.
 20. The apparatus of claim 19, wherein S comprises a number equal to or greater than two.
 21. A method for receiving a spread spectrum transmission of data symbols, comprising: correlating a received signal with a plurality of pseudo-random sequences wherein each sequence of the plurality of pseudo-random sequences differ from each other sequence of the plurality of sequences and wherein the plurality of pseudo-random sequences comprise pseudo-random sequences used to transmit the signal; restoring a packet comprising a plurality of symbols; and retrieving the plurality of symbols from the restored packet.
 22. The method of claim 21, wherein correlating the received signal with a plurality of pseudo-random sequences comprises correlating the received signal with S pseudo-random sequences.
 23. The method of claim 22, wherein restoring a packet comprising a plurality of symbols comprises restoring a packet comprising S symbols.
 24. The method of claim 23, wherein the S pseudo-random sequences comprise S successive pseudo-random sequences.
 25. The method of claim 24, wherein the S symbols comprise S successive symbols.
 26. The method of claim 12, wherein S comprises a number equal to or greater than two.
 27. An apparatus capable of receiving a spread spectrum transmission of data symbols, comprising: means for correlating a received signal with a plurality of pseudo-random sequences wherein each sequence of the plurality of pseudo-random sequences differ from each other sequence of the plurality of sequences and wherein the plurality of pseudo-random sequences comprise pseudo-random sequences used to transmit the signal; means for restoring a packet comprising a plurality of symbols; and means for retrieving the plurality of symbols from the restored packet.
 28. The apparatus of claim 27, wherein the means for correlating the received signal with a plurality of pseudo-random sequences comprises means for correlating the received signal with S pseudo-random sequences.
 29. The apparatus of claim 28, wherein the means for restoring a packet comprising a plurality of symbols comprises means for restoring a packet comprising S symbols.
 30. The apparatus of claim 29, wherein the S pseudo-random sequences comprise S successive pseudo-random sequences.
 31. The apparatus of claim 30, wherein the S symbols comprise S successive symbols.
 32. The apparatus of claim 31, wherein S comprises a number equal to or greater than two. 